首页> 外文OA文献 >A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
【2h】

A scalable TFETI algorithm for two-dimensional multibody contact problems with friction

机译:带有摩擦的二维多体接触问题的可扩展TFETI算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

A Total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid of rigid body motions is adapted to the solution of two-dimensional multibody contact problems of elasticity with the Coulomb friction and proved to be scalable for the Tresca friction. The algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. In addition, its performance is illustrated on analysis of the yielding clamp connection with the Coulomb friction.
机译:一种基于Total FETI(TFETI)的域分解算法,该算法具有通过自然的刚性运动进行粗化预处理的条件,适用于二维多体库仑摩擦弹性接触问题的解决方案,并证明可伸缩用于Tresca摩擦。如果分解参数和离散化参数之比是有界的,该算法将以渐近成比例的代价找到一个近似解,该代价与变量的数量成正比。该分析基于Farhat,Mandel和Roux的经典结果,即具有线性问题的自然粗糙网格的FETI的可伸缩性,以及我们针对有界和等式约束问题开发的最佳二次规划算法。该算法保留了经典FETI方法的并行可伸缩性。理论结果和数值实验均表明该算法具有较高的效率。此外,通过对屈服夹具与库仑摩擦的连接进行分析,可以说明其性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号